On the transitive closure of reciprocal [0, 1]-valued relations
نویسندگان
چکیده
We build a theoretical framework that enables to extend the concept of transitive closure to the class of complete crisp relations, the class of reciprocal 3-valued relations and the class of reciprocal [0, 1]valued relations. We present algorithms to compute the transitive closure of reciprocal [0, 1]-valued relations, where the type of transitivity is either weak stochastic transitivity or strong stochastic transitivity.
منابع مشابه
Fuzzy number-valued fuzzy relation
It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...
متن کاملTransitive Closure of Interval-valued Fuzzy Relations
In this paper are introduced some concepts of interval-valued fuzzy relations and some of their properties: reflexivity, symmetry, T-transitivity, composition and local reflexivity. The existence and uniqueness of T-transitive closure of interval-valued fuzzy relations is proved. An algorithm to compute the T-transitive closure of finite interval-valued fuzzy relations is showed. Some propertie...
متن کاملTransitive Closure of Innnite Graphs and Its Applications Transitive Closure of Innnite Graphs and Its Applications
Integer tuple relations can concisely summarize many types of information gathered from analysis of scientiic codes. For example they can be used to precisely describe which iterations of a statement are data dependent of which other iterations. It is generally not possible to represent these tuple relations by enumerating the related pairs of tuples. For example, it is impossible to enumerate ...
متن کاملAxiomatizability of algebras of binary relations
Let Λ be a signature and A = (A, Λ) be an algebra. We say that A is an algebra of binary relations if A ⊆ P(U × U) for some set U and each operation in Λ is interpreted as a natural operation on relations. 0 is the empty set. Other possible operations include reexive-transitive closure * , the residuals \ and / of composition, domain d and range r, etc. Algebras of binary relations Let Λ be a s...
متن کاملINCOMPLETE INTERVAL-VALUED HESITANT FUZZY PREFERENCE RELATIONS IN DECISION MAKING
In this article, we propose a method to deal with incomplete interval-valuedhesitant fuzzy preference relations. For this purpose, an additivetransitivity inspired technique for interval-valued hesitant fuzzypreference relations is formulated which assists in estimating missingpreferences. First of all, we introduce a condition for decision makersproviding incomplete information. Decision maker...
متن کامل